On lower bounds for Information Set Decoding over Fq
نویسندگان
چکیده
Code-based cryptosystems are promising candidates for post-quantum cryptography. The increasing number of cryptographic schemes that are based on codes over fields different from F2 requires an analysis of their security. Information Set Decoding (ISD) is one of the most important generic attacks against code-based cryptosystems. We give lower bounds for ISD over Fq, thereby anticipating future software and hardware improvements. Our results allow to compute conservative parameters for cryptographic applications.
منابع مشابه
Information-Set Decoding for Linear Codes over Fq
A code-based cryptosystem is considered secure if the best known attack against it is information-set decoding. Stern’s algorithm and its improvements are well optimized and the complexity is reasonably well understood. However, these algorithms only handle codes over F2. This paper presents a generalization of Stern’s information-set-decoding algorithm for decoding linear codes over arbitrary ...
متن کاملFinite field Kakeya and Nikodym sets in three dimensions
We give improved lower bounds on the size of Kakeya and Nikodym sets over Fq. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in Fq, and show that this conjecture implies an optimal bound on the size of a Nikodym set. Finally, we study the notion of a weak Nikodym set and give improved, and in some special cases optimal, bounds fo...
متن کاملEnee 739c: Advanced Topics in Signal Processing: Coding Theory Instructor: Alexander Barg
In lectures 3-6 we looked at decoding of codes from a probabilistic perspective, ignoring the constructive aspect of our systems. Here we wish to change the point of view and study issues related to implementation complexity of decoding of linear codes. We will start with a technical topic of independent interest: properties of random matrices over Fq. The main use of these results will be in a...
متن کاملFinite length LT codes over Fq for unequal error protection with biased sampling of input nodes
Finite length LT codes over higher order Galois fields Fq for unequal error protection (UEP) are analysed under maximum likelihood (ML) decoding. We consider a biased sampling method to create the LT code graph. In contrast to a previous approach by Rahnavard et al., where a predetermined number of edges is created per importance class given a check node of degree d, our procedure allows to pre...
متن کاملMay-Ozerov Algorithm for Nearest-Neighbor Problem over 𝔽q and Its Application to Information Set Decoding
May and Ozerov proposed an algorithm for the nearest-neighbor problem of vectors over the binary field at EUROCRYPT 2015. They applied their algorithm to the decoding problem of random linear codes over the binary field and confirmed the performance improvement. We describe their algorithm generalized to work for vectors over the finite field Fq with arbitrary prime power q. We also apply the g...
متن کامل